Practical Aspect-graph Derivation Incorporating Feature Segmentation Performance

نویسندگان

  • Andrew W. Fitzgibbon
  • Robert B. Fisher
چکیده

A procedure is described for the automatic derivation of aspect graphs of surface-based geometric models. The object models are made of finite, typed, second order surface patches allowing the representation of a large number of complex curved objects while retaining ease of recognition. A new representation, the detectability sphere, is developed to encode feature detectability constraints. The detectability metric is directly related to the performance of the imaging system, allowing the generated aspect graph to more truthfully represent the scene's relationship with the vision system. An algorithm is described which fuses information from several views of the object to produce a small number of characteristic views which cover some desired portion of the viewsphere, and annotates these fundamental views with pose-verification hints. The procedure is compared with previous analytic and approximate solutions to the aspect-graph problem regarding relevance to the vision process, range of applicability, and computational complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inexact Graph Matching for Facial Feature Segmentation and Recognition in Video Sequences: Results on Face Tracking

This paper presents a method for the segmentation and recognition of facial features and face tracking in digital video sequences based on inexact graph matching. It extends a previous approach proposed for static images to video sequences by incorporating the temporal aspect that is inherent to such sequences. Facial features are represented by attributed relational graphs, in which vertices c...

متن کامل

Segmentation of Magnetic Resonance Brain Imaging Based on Graph Theory

Introduction: Segmentation of brain images especially from magnetic resonance imaging (MRI) is an essential requirement in medical imaging since the tissues, edges, and boundaries between them are ambiguous and difficult to detect, due to the proximity of the brightness levels of the images. Material and Methods: In this paper, the graph-base...

متن کامل

Geodesic Distance Histogram Feature for Video Segmentation

This paper proposes a geodesic-distance-based feature that encodes global information for improved video segmentation algorithms. The feature is a joint histogram of intensity and geodesic distances, where the geodesic distances are computed as the shortest paths between superpixels via their boundaries. We also incorporate adaptive voting weights and spatial pyramid configurations to include s...

متن کامل

A comparative performance of gray level image thresholding using normalized graph cut based standard S membership function

In this research paper, we use a normalized graph cut measure as a thresholding principle to separate an object from the background based on the standard S membership function. The implementation of the proposed algorithm known as fuzzy normalized graph cut method. This proposed algorithm compared with the fuzzy entropy method [25], Kittler [11], Rosin [21], Sauvola [23] and Wolf [33] method. M...

متن کامل

Dynamic-structured Semantic Propagation Network

Semantic concept hierarchy is still under-explored for semantic segmentation due to the inefficiency and complicated optimization of incorporating structural inference into dense prediction. This lack of modeling semantic correlations also makes prior works must tune highly-specified models for each task due to the label discrepancy across datasets. It severely limits the generalization capabil...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992